Probabilistically Survivable MASs

نویسندگان

  • Sarit Kraus
  • V. S. Subrahmanian
  • N. Cihan Tas
چکیده

Muhiagent systems (MAS) can "go down" for a large number of reasons, ranging from system malfunctions and power failures to malicious attacks. The placement of agents on nodes is called a deployment of the MAS. We develop a probabilistic model of survivability of a deployed MAS and provide two algorithms to compute the probability of survival of a deployed MAS. Our probabilistic model docs not make independence assumptions though such assumptions can be added if so desired. An optimal deployment of a MAS is one that maximizes its survival probability. We provide a mathematical answerto this question, an algorithm that computes an exact solution to this problem, as well as several algorithms that quickly compute approximate solutions to the problem. We have implemented our algorithms our implementation demonstrates that computing deployments can be done scalably.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Strategy to Find Solution for Survivable Multicommodity ‎Network‎

This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...

متن کامل

A heuristic algorithm for survivable mapping in IP-over-WDM networks

Survivability is an important issue in IP-over-WDM networks. IP layer failure recovery is possible only if the IP topology is mapped onto the WDM topology in a survivable way, i.e., the failure of any single fiber will not disconnect the IP topology. This problem has been proven NP-hard in [1]. And an integer linear programming (ILP) formulation that solves this problem is provided in [2]. We p...

متن کامل

Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks

In this work we introduce and describe optimal sets of survivable paths defined on an undirected simple graph G. An optimal set of survivable paths in G corresponds to a set of mesh-restored lightpaths in an optical network that minimizes the number of optical channels. We present several fundamental properties of optimal sets of survivable paths in G.

متن کامل

Survivable lightpath routing: a new approach to the design of WDM-based networks

Network restoration is often done at the electronic layer by rerouting traffic along a redundant path. With Wavelength Division Multiplexing (WDM) as the underlying physical layer, it is possible that both the primary and backup paths traverse the same physical links and would fail simultaneously in the event of a link failure. It is therefore critical that lightpaths are routed in such a way t...

متن کامل

A directed cycle-based column-and-cut generation method for capacitated survivable network design

A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. Here we present a polyhedral approach for designing survivable networks. We describe a mixed–integer programming model, in which sufficient slack is explicitly introduced on the directed cycles of the network while flow routing decisions are made. In case of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003